Inherently nonfinitely based lattices

نویسندگان

  • Ralph Freese
  • George F. McNulty
  • James B. Nation
چکیده

We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) generated by L is locally finite and that L belongs to no locally finite finitely axiomatizable equational class. We also provide an example of a lattice which fails to be inherently nonfinitely based but whose equational theory is not finitely axiomatizable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modular inherently nonfinitely based lattice

Proof. As observed in McNulty [7], a locally finite variety V of finite type is inherently nonfinitely based if and only if for infinitely many natural numbers N , there is a non-locally-finite algebra each of whose N -generated subalgebras belongs to V. We prove the theorem by establishing these facts. We assume the reader is familiar with the basic facts of modular lattices; see [1], [2], [6]...

متن کامل

Inherently Nonfinitely Based Solvable Algebras

We prove that an inherently nonfinitely based algebra cannot generate an abelian variety. On the other hand, we show by example that it is possible for an inherently nonfinitely based algebra to generate a strongly solvable variety.

متن کامل

Slim Groupoids

Slim groupoids are groupoids satisfying x(yz) ≈ xz. We find all simple slim groupoids and all minimal varieties of slim groupoids. Every slim groupoid can be embedded into a subdirectly irreducible slim groupoid. The variety of slim groupoids has the finite embeddability property, so that the word problem is solvable. We introduce the notion of a strongly nonfinitely based slim groupoid (such g...

متن کامل

On the Finite Basis Problem for the Monoids of Triangular Boolean Matrices

Let T Bn denote the submonoid of all upper triangular boolean n×n matrices. It is shown by Volkov and Goldberg [6] that T Bn is nonfinitely based if n > 3, but the cases when n = 2, 3 remained open. In this paper, it is shown that the monoid T B2 is finitely based and a finite identity basis for the monoid T B2 is given. Moreover, it is shown that T B3 is inherently nonfinitely based. Hence T B...

متن کامل

The Semigroups B2 and B0 are Inherently nonfinitely Based, as restriction Semigroups

The five-element Brandt semigroup B2 and its four-element subsemigroup B0, obtained by omitting one nonidempotent, have played key roles in the study of varieties of semigroups. Regarded in that fashion, they have long been known to be finitely based. The semigroup B2 carries the natural structure of an inverse semigroup. Regarded as such, in the signature {·,−1 }, it is also finitely based. It...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 115  شماره 

صفحات  -

تاریخ انتشار 2002